#include<bits/stdc++.h>
using namespace std;
long long n,a[100005],lose[100005],atc[100005],ans = 0;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i = 1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    for(int i = 1;i<=n;i++){
        for(int j = i;j<=n;j++){
            if(a[i]<a[j]&&!lose[i]&&!atc[j]){
                ans++;
                lose[i] = 1;
                atc[j] = 1;
            }
        }
    }
    ans = n-ans;
    cout<<ans<<endl;
    return 0;
}
